Price-Based Information Certificates for Minimal-Revelation Combinatorial Auctions

نویسنده

  • David C. Parkes
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Issues in Computational Vickrey Auctions

The Vickrey auction has been widely advocated for multiagent systems. First we review its limitations so as to guide practitioners in their decision of when to use that protocol. These limitations include lower revenue than alternative protocols, lying in non-private-value auctions, bidder collusion, a lying auctioneer, and undesirable revelation of sensitive information. We discuss the special...

متن کامل

A combinatorial procurement auction featuring bundle price revelation without free-riding

Combinatorial auctions are currently becoming a common practice in industrial procurement, allowing bidders (sellers of goods and services in the procurement setting) to avoid the risk of selling good or service bundles that are incomplete, inefficient, or excessively expensive to deliver. Two major concerns in combinatorial auction design are the revelation or discovery of market price informa...

متن کامل

Expressing Preferences with Price-Vector Agents in Combinatorial Auctions

Title of dissertation: EXPRESSING PREFERENCES WITH PRICE-VECTOR AGENTS IN COMBINATORIAL AUCTIONS Robert W. Day, Doctor of Philosophy, 2004 Dissertation directed by: Professor Subramanian Raghavan Decision and Information Technologies Department, The Robert H. Smith School of Business In this work, we investigate two combinatorial auction formats in which each bidding bidder may be represented b...

متن کامل

Single Item Auctions with Discrete Action Spaces

An implicit assumption in truthful mechanism design is that revelation of one’s true type is always feasible. Indeed, this is not a problem in standard mechanism design setups, where it is up to the designer to determine the action spaces. However, this assumption fails to hold in many practical scenarios, where there are natural, exogenous constraints on the set of possible actions. For exampl...

متن کامل

Minimal Preference Elicitation in Combinatorial Auctions

Combinatorial auctions (CAs) where bidders can bid on bundles of items can be very desirable market mechanisms when the items sold exhibit complementarity and/or substitutability, so the bidder’s valuations for bundles are not additive. However, in a basic CA, the bidders may need to bid on exponentially many bundles, leading to difficulties in determining those valuations, undesirable informat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002